Tootfinder

The solenoidal Virasoro algebra and its simple weight modules
Boujemaa Agrebaoui, Walid Mhiri
https://arxiv.org/abs/2403.03753 https://

The solenoidal Virasoro algebra and its simple weight modules
Let $A_n=\mathbb{C}[t_i^{\pm1},~1\leq i\leq n]$ be the algebra of Laurent polynomials in $n$-variables. Let $μ=(μ_1,\ldots,μ_n)$ be a generic vector in $\mathbb{C}^n$ and $Γ_μ=\{μ\cdotα,α\in \mathbb{Z}^n\}$ where $μ\cdotα=\displaystyle\sum_{i=1}^nμ_iα_i$ for $α=(α_1,\ldots,α_n)\in \mathbb{Z}^n$. Denote by $d_μ$ the vector field: $$d_μ=\displaystyle\sum_{i=1}^nμ_it_i\frac{d}{dt_i}.$$ In \cite{BiFu}, Y. Billig and V. Futorny introduce the solenoidal Lie algebra $\mathbf{W}…

@… Seems the action used in this last code block is prefixed with actions/ https://akrabat.com/using-github-actions-to-add-go-binaries-to-a-relea…

Mit einer Blockade bei Playa del Carmen fordern Umweltschützer*innen einen Stopp der Arbeiten am #TrenMaya
Der Protest wurde im Rahmen des #Weltwassertag es am 22. März ausgerufen. Die Arbeiten des #Megaprojekt

Con bloqueo a Playa del Carmen, ambientalistas exigen freno a obras del Tren Maya tramo 5 sur
La protesta fue convocada en el marco del Día Mundial del Agua, conmemorado este 22 de marzo, porque las obras del proyecto ferroviario están perforando cuevas inundadas de agua dulce al poniente de Playa del Carmen y Tulum, donde se ubican el acuífero maya.

Higher-dimensional grid-imprimitive block-transitive designs
Seyed Hassan Alavi, Carmen Amarra, Ashraf Daneshkhah, Alice Devillers, Cheryl E. Praeger
https://arxiv.org/abs/2404.11241

Higher-dimensional grid-imprimitive block-transitive designs
It was shown in 1989 by Delandtsheer and Doyen that, for a $2$-design with $v$ points and block size $k$, a block-transitive group of automorphisms can be point-imprimitive (that is, leave invariant a nontrivial partition of the point set) only if $v$ is small enough relative to $k$. Recently, exploiting a construction of block-transitive point-imprimitive $2$-designs given by Cameron and the last author, four of the authors studied $2$-designs admitting a block-transitive group that preserves …

Pitchfork: scrivere di musica e ballare di economia.
Su MachinaPost le opinioni di Enzo Baruffaldi (Memoria polaroid – Un blog alla radio), Francesco Eandi (Humans vs Robots) e Manuel Graziani (Manwell blog, Rumore) sul recente accorpamento di Pitchfork a GQ
https://machinapost.…

Pitchfork: scrivere di musica e ballare di economia - Machinapost
Sull’accorpamento di Pitchfork e GQ, oltre ai post usciti e rilanciati da Machinapost, mi interessava sentire anche il parere di tre persone che seguo e leggo molto volentieri e che, da angolazioni differenti, potessero fornire ulteriori punti di vista su questa bizzarra attività che è lo scrivere di musica, online, offline o sui muri che […]

Google so badly wants to disown "Bard", it is ascribing it to competitors.
Me: What are the names of your top competitor offerings?
Gemini: [1]
Me: Are you sure about # 3?
Gemini: [2, yup it's all on me 🤦‍♂️]
https://gemini.google.com/share/c24cc7

New preconditioner strategy for solving block four-by-four linear systems: An application to the saddle-point problem from 3D Stokes equation
Achraf Badahmane, Ahmed Ratnani, Hassane Sadok
https://arxiv.org/abs/2402.13373

New preconditioner strategy for solving block four-by-four linear systems: An application to the saddle-point problem from 3D Stokes equation
We have presented a fast method for solving a specific type of block four-by-four saddlepoint problem arising from the finite element discretization of the generalized 3D Stokes problem. We analyze the eigenvalue distribution and the eigenvectors of the preconditioned matrix. Furthermore, we suggested utilizing the preconditioned global conjugate gradient method (PGCG) as a block iterative solver for handling multiple right-hand sides within the sub-system and give some new convergence results.…

This https://arxiv.org/abs/2111.10409 has been replaced.
link: https://scholar.google.com/scholar?q=a

The Acrobatics of BQP
One can fix the randomness used by a randomized algorithm, but there is no analogous notion of fixing the quantumness used by a quantum algorithm. Underscoring this fundamental difference, we show that, in the black-box setting, the behavior of quantum polynomial-time ($\mathsf{BQP}$) can be remarkably decoupled from that of classical complexity classes like $\mathsf{NP}$. Specifically: -There exists an oracle relative to which $\mathsf{NP^{BQP}}\not\subset\mathsf{BQP^{PH}}$, resolving a 2005…